#include<bits/stdc++.h>
using namespace std;
namespace IO{
    char buff[1<<21],*p1=buff,*p2=buff;
    char getch(){
        return p1==p2&&(p2=((p1=buff)+fread(buff,1,1<<21,stdin)),p1==p2)?EOF:*p1++;
    }
    template<typename T>
    void read(T &x){
        char ch=getch();int fl=1;x=0;
        while(ch>'9'||ch<'0'){if(ch=='-')fl=-1;ch=getch();}
        while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getch();}
        x*=fl;
    }
    template<typename T,typename ...Args>
    void read(T &x,Args& ...args){
        read(x);read(args...);
    }
    char obuf[1<<21],*p3=obuf;
    void putch(char ch){
        if(p3-obuf<(1<<21))*p3++=ch;
        else fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=ch;
    }
    char ch[100];
    template<typename T>
    void write(T x){
        if(!x)return putch('0');
        if(x<0)putch('-'),x*=-1;
        int top=0;
        while(x)ch[++top]=x%10+48,x/=10;
        while(top)putch(ch[top]),top--;
    }
    template<typename T,typename ...Args>
    void write(T x,Args ...args){
        write(x);write(args...);
    }
    void flush(){fwrite(obuf,p3-obuf,1,stdout);}
}
using namespace IO;
const int N=1e7+5,mod=998244353;
inline int Mod(int x){return x>=mod?x-mod:x;}
inline int poww(int x,int y){
	int sum=1;
	while(y){
		if(y&1)sum=1ll*sum*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return sum;
}
int n,k,ans;
int fac[N],inv[N];
int vis[N],p[N],tot;
int f[N];
signed main(){
	freopen("length.in","r",stdin);
	freopen("length.out","w",stdout);
	read(n,k);k--;
	for(int i=fac[0]=1;i<=n;i++)fac[i]=1ll*i*fac[i-1]%mod;
	inv[n]=poww(fac[n],mod-2);for(int i=n;i;i--)inv[i-1]=1ll*i*inv[i]%mod;
	f[1]=1;
	for(int i=2;i<=n;i++){
		if(!vis[i]){
			f[i]=poww(i,k);
			p[++tot]=i;
			vis[i]=tot;
		}
		for(int j=1;j<=vis[i];j++){
			if(p[j]*i>n)break;
			vis[p[j]*i]=j;
			f[p[j]*i]=1ll*f[p[j]]*f[i]%mod; 
		}
	}
	for(int i=n,sum=1;i;i--,sum=1ll*sum*n%mod)ans=Mod(ans+1ll*sum*inv[n-i]%mod*f[i]%mod);
	ans=1ll*fac[n]*ans%mod;
	write(ans);
	flush();
	return 0;
}
